Learned Distributed Image Compression with Multi-Scale Patch Matching in Feature Domain

نویسندگان

چکیده

Beyond achieving higher compression efficiency over classical image codecs, deep is expected to be improved with additional side information, e.g., another from a different perspective of the same scene. To better utilize information under distributed scenario, existing method only implements patch matching at domain solve parallax problem caused by difference in viewing points. However, not robust variance scale, shape, and illumination angles, can make full use rich texture image. resolve this issue, we propose Multi-Scale Feature Domain Patch Matching (MSFDPM) fully utilizes decoder model. Specifically, MSFDPM consists feature extractor, multi-scale module, fusion network. Furthermore, reuse inter-patch correlation shallow layer accelerate layer. Finally, find that our further improves rate about 20% compared domain.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Image Domain Fractal Compression by DCT Domain Block Matching

Fractal image compression entails a computationally costly search for matching image blocks. It is proposed that a block be represented by its DCT coefficients, which may be made invariant to many of the usual block transforms. Due to the energy packing properties of the DCT, the efficiency of an existing multidimensional nearest neighbour search is improved.

متن کامل

Distributed multi-view image coding with learned dictionaries

This paper addresses the problem of distributed image coding in camera neworks. The correlation between multiple images of a scene captured from different viewpoints can be effiiciently modeled by local geometric transforms of prominent images features. Such features can be efficiently represented by sparse approximation algorithms using geometric dictionaries of various waveforms, called atoms...

متن کامل

Exploiting Spatial Correlation in Pixel-Domain Distributed Image Compression

Contrary to convention, we construct distributed image compression codecs that operate in the pixel-domain, yet exploit spatial correlation at the decoder only. For lossless compression of binary images of text, we propose two novel decoders: one assumes the image to be a one-dimensional stationary Markov process, and the other assumes it to be a two-dimensional stationary Markov random field. ...

متن کامل

Robust Feature Point Matching in General Multi-Image Setups

We present a robust feature matching approach that considers features from more than two images during matching. Traditionally, corners or feature points are matched between pairs of images. Starting from one image, corresponding features are searched in the other image. Yet, often this two-image matching is only a subproblem and actually robust matches over multiple views and/ or images acquir...

متن کامل

Pattern Matching Image Compression

We propose a non-transform image compression scheme based on approximate pattern matching, that we name Pattern Matching Image Compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approzimately occurs in the already processed image. We consider both the Hamming distan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i4.25551